On locality of binary distance-optimal codes
نویسندگان
چکیده
In modern large-scale storage systems, locally repairable codes(LRCs) improve the repair efficiency when node failure occurs. This work discusses several new methods for constructing LRCs with small localities using generator and parity-check matrices approach. Many have been found, all distance-optimal (d-optimal) or best-known (BK). Based on newly obtained known results, a database presenting d-optimal (or BK) binary relatively locality where n ≤ 40 is given. The majority of them are r-optimal near r-optimal.
منابع مشابه
Binary Codes with Locality for Four Erasures
In this paper, binary codes with locality for four erasures are considered. An upper bound on the rate of this class of codes is derived. An optimal construction for codes meeting the bound is also provided. The construction is based on regular bipartite graphs of girth 6 and employs the sequential approach of locally recovering from multiple erasures. An extension of this construction that gen...
متن کاملLearning Affine Robust Binary Codes Based on Locality Preserving Hash
In large scale vision applications, high-dimensional descriptors extracted from image patches are in large quantities. Thus hashing methods that compact descriptors to binary codes have been proposed to achieve practical resource consumption. Among these methods, unsupervised hashing aims to preserve Euclidean distances, which do not correlate well with the similarity of image patches. Supervis...
متن کاملMinimum Distance of Binary Nonlinear Codes∗
A binary nonlinear code can be represented as the union of cosets of a binary linear subcode. Using this representation, new algorithms methods to compute the minimum Hamming weight and distance are presented. The performance of these algorithms is also studied.
متن کاملOn the Minimum Distance of Non Binary LDPC Codes
Minimum distance is an important parameter of a linear error correcting code. For improved performance of binary Low Density Parity Check (LDPC) codes, we need to have the minimum distance grow fast with n, the codelength. However, the best we can hope for is a linear growth in dmin with n. For binary LDPC codes, the necessary and sufficient conditions on the LDPC ensemble parameters, to ensure...
متن کاملLower bounds on the minimum average distance of binary codes
Let β(n,M) denote the minimum average Hamming distance of a binary code of length n and cardinality M. In this paper we consider lower bounds on β(n,M). All the known lower bounds on β(n,M) are useful when M is at least of size about 2n−1/n. We derive new lower bounds which give good estimations when size of M is about n. These bounds are obtained using linear programming approach. In particula...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cryptography and Communications
سال: 2023
ISSN: ['1936-2455', '1936-2447']
DOI: https://doi.org/10.1007/s12095-023-00626-6